An Empirical Comparison of Priority-Queue and Event-Set Implementations
نویسنده
چکیده
منابع مشابه
AU EIWRICAL COIUPARISON OF PRIORITY-QUEUE AUD EVEUFSET lMPLElWEUTd?lONS
During the last decade, a number of new priorityqueue implementations have evolved, including pagodas [6, 261, skew heaps [21, 221, splay trees [21, 231, pairing heaps 1183, and binomial queues [4, 5, 241. In addition, a number of special priority-queue implementations for representing the pending event set in discrete event simulation Shave been developed, including the two-list implementation...
متن کاملA Comparative Study of Some Priority Queues Suitable for Implementation of the Pending Event Set1
Implementation of the pending event set (PES) is often crucial to the execution speed of a simulation. Parallel access implementation of the PES is a possible means of gaining performance improvement in discrete event simulation. In this paper a comparative study of some sequential and parallel access implementations of the PES is presented, these include linked lists, the Calendar Queue, the L...
متن کاملLazy Queue: A new approach to implementing the Pending-event Set
In discrete event simulation, very often the future event set is represented by a priority queue. The data structure used to implement the queue and the way operations are performed on it are often crucial to the execution time of a simulation. In this paper a new priority queue implementation strategy, the Lazy Queue, is presented. It is tailored to handle operations on the pending event set e...
متن کاملThe Bounded Sequential Searching (Bss) Priority Queue in Discrete Event Simulation
In Discrete Event Simulation the whole running time is mainly determined by the type of data structure intended to manage the pending event set. The Bounded Sequential Searching (BSS) Priority Queue is a pending event set implementation proposal for which empirical evidence of good performance, under the Hold Model, is shown. The complexity of BSS associated algorithms are assessed and some imp...
متن کاملA Finite Capacity Priority Queue with Discouragement
In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Commun. ACM
دوره 29 شماره
صفحات -
تاریخ انتشار 1986